Parallel computations using a cluster of workstations to simulate elasticity problems
نویسندگان
چکیده
منابع مشابه
Parallel Probabilistic Computations on a Cluster of Workstations
Probabilistic algorithms are computationally intensive approximate methods for solving intractable problems. Probabilistic algorithms are excellent candidates for cluster computations because they require little communication and synchronization. It is possible to specify a common parallel control structure as a generic algorithm for probabilistic cluster computations. Such a generic parallel a...
متن کاملScheduling Large-Scale Parallel Computations on Networks of Workstations
Workstation networks are an underutilized yet valuable resource for solving large-scale parallel problems. In this paper, we present \idle-initiated" techniques for eeciently scheduling large-scale parallel computations on workstation networks. By \idle-initiated," we mean that idle computers actively search out work to do rather than wait for work to be assigned. The idle-initiated scheduler o...
متن کاملParallel Computation for Chromosome Reconstruction on a Cluster of Workstations
Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is a problem of high computational complexity which provides the motivation for parallel computing. Parallelization strategies for a maximum likelihood estimation-based approach to physical map reconstruction are present...
متن کاملParallel Non-Rigid Registration on a Cluster of Workstations
Over recent years, non-rigid registration has become a major issue in medical imaging. It consists in recovering a dense point-to-point correspondence field between two images and usually takes a long time. This is in contrast to the needs of a clinical environment, where usability and speed are major constraints, leading to the necessity of reducing the computation time from slightly less than...
متن کاملParallel Text Searching Application on a Heterogeneous Cluster of Workstations
In this paper we propose a high-performance text searching implementation on a heterogeneous cluster of workstations using MPI message passing library. We test this parallel implementation and present experimental results for different text sizes and number of workstations. We also present a performance prediction model that agrees well with our experimental measurements.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2016
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/776/1/012081